A Symbolic Model for Timed Concurrent Constraint Programming
نویسندگان
چکیده
منابع مشابه
A Multimedia Programming Model Based on Timed Concurrent Constraint Programming
We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The real-time extensions that have been proposed for the concurrent constraint programming framework are coupled with the object-oriented and inheritance mechanisms that have been ...
متن کاملUniversal Timed Concurrent Constraint Programming
In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concurrent Constraint (utcc) increases the expressiveness of tcc languages allowing infinite behaviour and mobility. We introduce a constructor of the form (abs x, c)P (Abstraction in P) that can be viewed as a dual operator of the...
متن کاملTimed Default Concurrent Constraint Programming
Synchronous programming (Berry (1989)) is a powerful approach to programming reactive systems. Following the idea that “processes are relations extended over time” (Abramsky (1993)), we propose a simple but powerful model for timed, determinate computation, extending the closure-operator model for untimed concurrent constraint programming (CCP). In (Saraswat et al. 1994a) we had proposed a mode...
متن کاملTimed Concurrent Constraint Programming in Systems Biology
Systems biology aims at getting a higher-level understanding of living matter, building on the available data at the molecular level. In this field, theories and methods from computer science have proven very useful, mainly for system modeling and simulation. Here we argue that languages based on timed concurrent constraint programming (timed ccp) —a well-established model for concurrency based...
متن کاملFoundations of Timed Concurrent Constraint Programming
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denotational character. We show how programs may be compiled into finite-state machines with loop-free ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2015
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2015.04.010